ROBUST TRACKING ERROR OPTIMIZATION PROBLEMS BY SECOND-ORDER CONE PROGRAMMING
نویسندگان
چکیده
منابع مشابه
Error bound optimization using second order cone programming
In safety of life applications using satellite navigation, the Protection Level (PL) equation translates what is known about the pseudorange errors into a hard bound on the positioning error (the Protection Level). The current PL equations for Satellite Based Augmentation Systems are based on Gaussian statistics: all errors are characterized by a zero mean Gaussian distribution which is an uppe...
متن کاملSecond Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems
A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...
متن کاملSparse Second Order Cone Programming Formulations for Convex Optimization Problems
Second order cone program (SOCP) formulations of convex optimization problems are studied. We show that various SOCP formulations can be obtained depending on how auxiliary variables are introduced. An efficient SOCP formulation that increases the computational efficiency is presented by investigating the relationship between the sparsity of an SOCP formulation and the sparsity of the Schur com...
متن کاملSecond-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملSecond-Order Cone Programming Formulations for Robust Multiclass Classification
Multiclass classification is an important and ongoing research subject in machine learning. Current support vector methods for multiclass classification implicitly assume that the parameters in the optimization problems are known exactly. However, in practice, the parameters have perturbations since they are estimated from the training data, which are usually subject to measurement noise. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Operations Research Society of Japan
سال: 2005
ISSN: 1349-8940,2188-8280
DOI: 10.15807/torsj.48.12